Computability theory - PDFSEARCH.IO - Document Search Engine

Computability theory
Results: 1231

#	Item
371	History of Lambda-calculus and Combinatory Logic J. Roger Hindley † 2006, from Swansea University Mathematics Department Research Report Add to Reading List Source URL: www.users.waitrose.com Language: English - Date: 2008-01-14 18:38:50 Lambda calculus Combinatory logic Computability theory Fixed-point combinator Function Haskell Curry Free variables and bound variables Principia Mathematica First-order logic Mathematics Mathematical logic Theoretical computer science
372	The Origin of Physical Laws and Sensations Bruno Marchal, IRIDIA, Université de Bruxelles Résumé : I will first present a non constructive argument showing that the mechanist hypothesis in cognitive science gives enou Add to Reading List Source URL: iridia.ulb.ac.be Language: English - Date: 2007-06-27 08:53:52 Computability theory Theory of computation Quantum measurement Alan Turing Quantum mechanics Church–Turing thesis Computable function Quantum indeterminacy Indeterminacy Theoretical computer science Physics Science
373	Chapter 4: Computability Algorithmic Adventures From Knowledge to Magic Book by Juraj Hromkoviˇ Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2011-10-24 15:09:33 Computability theory Mathematical logic Theory of computation Logic in computer science Proof theory Undecidable problem Decision problem Algorithm Computability Theoretical computer science Mathematics Applied mathematics
374	CHAIN LADDER CORRELATIONS Greg Taylor Taylor Fry Consulting Actuaries Level 11, 55 Clarence Street Sydney NSW 2000 Add to Reading List Source URL: fbe.unimelb.edu.au Language: English - Date: 2013-08-05 02:23:08 Theory of computation Mathematics Mathematical sciences Μ operator Primitive recursive function Markov models Markov chain Computability theory
375	Chapter 2: Algorithmics Quotation Algorithmic Adventures From Knowledge to Magic Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2010-10-12 03:18:13 Theoretical computer science Computer program Mathematics Models of computation Computability theory Computing Algorithm Mathematical logic
376	Chapter 3 Artificial Knowledge 3.1 Introduction Add to Reading List Source URL: www.eeng.dcu.ie Language: English - Date: 2003-03-18 07:33:16 Computer science Philosophy of artificial intelligence Computability theory Human–computer interaction Turing machine Turing test Computing Machinery and Intelligence Universal Turing machine Computational complexity theory Alan Turing Artificial intelligence Science
377	1 Fixed-Parameter Tractability In this chapter, we introduce parameterized problems and the notion of fixed-parameter tractability. We start with an informal discussion that highlights the main issues behind the definiti Add to Reading List Source URL: lii.rwth-aachen.de Language: English - Date: 2014-02-04 08:14:43 NP-complete problems Analysis of algorithms Computability theory Complexity classes Parameterized complexity Dominating set Time complexity Computable function Parameter Theoretical computer science Computational complexity theory Applied mathematics
378	Pattern Recognition for Coinductive Proof Trees Katya Komendantskaya School of Computing, University of Dundee, UK AI4FM’11,Edinburgh 29 April 2011 Add to Reading List Source URL: www.ai4fm.org Language: English - Date: 2013-10-30 13:20:15 Computer programming Mathematical logic Category theory Functional programming Computability theory Coinduction Recursion Mathematical proof Machine learning Mathematics Logic Theoretical computer science
379	COMPUTING MACHINERY AND INTELLIGENCE:22 PM A. M. TuringComputing Machinery and Intelligence. Mind 49: . Add to Reading List Source URL: mypage.iu.edu Language: English - Date: 2015-01-11 16:22:30 Computer science Science Models of computation Computability theory Computing Machinery and Intelligence Turing machine Computer Finite-state machine Turing test Alan Turing Philosophy of artificial intelligence Artificial intelligence
380	Lecture 4: Is that Really Revising Logic? König’s paradox (and Berry’s variant). Let L be any language whose formulas are finite strings of finitely many basic symbols. Then (K1) Add to Reading List Source URL: www.philosophy.ox.ac.uk Language: English - Date: 2008-05-15 07:08:03 Set theory Berry paradox Constructible universe Ordinal numbers Computability theory Definable real number Proof theory Ordinal definable set Mathematical logic Mathematics Philosophy of mathematics

UPDATE